Pairs of forbidden class of subgraphs concerning K1, 3 and P6 to have a cycle containing specified vertices
نویسندگان
چکیده
In [3], Faudree and Gould showed that if a 2-connected graph contains no K1,3 and P6 as an induced subgraph, then the graph is hamiltonian. In this paper, we consider the extension of this result to cycles passing through specified vertices. We define the families of graphs which are extension of the forbidden pair K1,3 and P6, and prove that the forbidden families implies the existence of cycles passing through specified vertices.
منابع مشابه
On 3-regular 4-ordered graphs
A simple graph G is k-ordered (respectively, k-ordered hamiltonian), if for any sequence of k distinct vertices v1, . . . , vk of G there exists a cycle (respectively, hamiltonian cycle) in G containing these k vertices in the specified order. In 1997 Ng and Schultz introduced these concepts of cycle orderability and posed the question of the existence of 3-regular 4-ordered (hamiltonian) graph...
متن کاملComplexity of Coloring Graphs without Paths and Cycles
Let Pt and C` denote a path on t vertices and a cycle on ` vertices, respectively. In this paper we study the k-coloring problem for (Pt, C`)-free graphs. Maffray and Morel, and Bruce, Hoang and Sawada, have proved that 3-colorability of P5-free graphs has a finite forbidden induced subgraphs characterization, while Hoang, Moore, Recoskie, Sawada, and Vatshelle have shown that k-colorability of...
متن کاملPancyclicity of 3-connected graphs: Pairs of forbidden subgraphs
We characterize all pairs of connected graphs {X,Y } such that each 3-connected {X,Y }-free graph is pancyclic. In particular, we show that if each of the graphs in such a pair {X,Y } has at least four vertices, then one of them is the claw K1,3, while the other is a subgraph of one of six specified graphs.
متن کاملClaw-free 3-connected P11-free graphs are hamiltonian
We show that every 3-connected claw-free graph which contains no induced copy of P11 is hamiltonian. Since there exist non-hamiltonian 3-connected claw-free graphs without induced copies of P12 this result is, in a way, best possible. 1. Statement of the main result A graph G is {H1, H2, . . . Hk}-free if G contains no induced subgraphs isomorphic to any of the graphs Hi, i = 1, 2, . . . , k. A...
متن کاملA note on Brooks' theorem for triangle-free graphs
For the class of triangle-free graphs Brooks’ Theorem can be restated in terms of forbidden induced subgraphs, i.e. let G be a triangle-free and K1,r+1-free graph. Then G is r-colourable unless G is isomorphic to an odd cycle or a complete graph with at most two vertices. In this note we present an improvement of Brooks’ Theorem for triangle-free and rsunshade-free graphs. Here, an r-sunshade (...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discussiones Mathematicae Graph Theory
دوره 29 شماره
صفحات -
تاریخ انتشار 2009